Linear time algorithm for optimal feed-link placement
نویسندگان
چکیده
منابع مشابه
Linear time algorithm for optimal feed-link placement
Given a polygon representing a transportation network together with a point p in its interior, we aim to extend the network by inserting a line segment, called a feed-link, which connects p to the boundary of the polygon. Once a feed link is fixed, the geometric dilation of some point q on the boundary is the ratio between the length of the shortest path from p to q through the extended network...
متن کاملA Linear Time Algorithm for Optimum Tree Placement
LetN be a point placed directed graph andG be a sub-graph of N . We study the point placement problem of optimally re-placing the nodes in G assuming that the remaining nodes in N are fixed. The goal is to minimize the total “wiring” cost i.e. the cost of the internal nets of G plus the external nets connecting G to other other nodes of N . The cost of a net is the semi-perimeter of the smalles...
متن کاملA Linear Time Active Learning Algorithm for Link Classification
We present very efficient active learning algorithms for link classification in signed networks. Our algorithms are motivated by a stochastic model in which edge labels are obtained through perturbations of a initial sign assignment consistent with a two-clustering of the nodes. We provide a theoretical analysis within this model, showing that we can achieve an optimal (to whithin a constant fa...
متن کاملAn optimal algorithm for rectangle placement
In this paper we consider the problem of placing eeciently a rectangle in a two-dimensional layout that may not have the bottom-left placement property. This problem arises when we apply any one of a number of iterative improvement algorithms to the cutting stock problem or its variants. Chazelle has given an O(n)-time placement algorithm when the layout has the bottom-left property; we extend ...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2015
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2014.09.006